Quadratic kernelization for convex recoloring of trees

- Bodlaender, Hans L., Fellows, Michael R., Langston, Michael A., Ragan, Mark A., Rosamond, Frances A., Weyer, Mark

Upper and lower bounds for finding connected motifs in vertex-colored graphs

- Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stephane

Clustering with partial information

- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Frederico, Papadopoulos, Charis, Rosamond, Frances

The parameterized complexity of some minimum label problems

- Fellows, Michael R., Guo, Jiong, Kanj, Iyad

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

Clique-width is NP-complete

- Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan

Derivation of algorithms for cutwidth and related graph layout parameters

- Bodlaender, Hans L., Fellows, Michael R., Thilikos, Dimitrios M.

Distortion is fixed parameter tractable

- Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel, Losievskaja, Eelena, Rosamond, Frances A., Saurabh, Saket

Fixed-parameter algorithms for Kemeny rankings

- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.

Graph-based data clustering with overlaps

- Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Joannes

Haplotype inference constrained by plausible haplotype data

- Fellows, Michael R., Hartman, Tzvika, Hermelin, Danny, Landau, Gad M., Rosamond, Frances, Rozenberg, Liat

On problems without polynomial kernels

- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny

On the parameterized complexity of multiple-interval graph problems

- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane

Parameterized complexity of stabbing rectangles and squares in the plane

- Dom, Michael, Fellows, Michael R., Rosamond, Frances A.

Well-quasi-orders in subclasses of bounded treewidth graphs

- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances A.

What makes equitable connected partition easy

- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy

Clustering with partial information

- Bodlaender, Hans L., Fellows, Michael R., Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Rosamond, Frances

Computing Kemeny rankings, parameterized by the average K-T distance

- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedemeier, Rolf, Rosamond, Frances A.

Fixed-parameter algorithms for Kemeny Scores

- Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.

Graph layout problems parameterized by vertex cover

- Fellows, Michael R., Lokshtanov, Daniel, Misra, Neeldhara, Rosamond, Frances A., Saurabh, Saket